The selfnegadual properties of generalised quadratic Boolean functions
نویسندگان
چکیده
We define and characterise selfnegadual generalised quadratic Boolean functions by establishing a link, both to the multiplicative order of symmetric binary matrices, and also to the Hermitian self-dual F4-linear codes. This facilitates a novel way to classify Hermitian self-dual F4-linear codes.
منابع مشابه
Generalised Bent Criteria for Boolean Functions (II)
In the first part of this paper [16], some results on how to compute the flat spectra of Boolean constructions w.r.t. the transforms {I,H}, {H,N} and {I,H, N} were presented, and the relevance of Local Complementation to the quadratic case was indicated. In this second part, the results are applied to develop recursive formulae for the numbers of flat spectra of some structural quadratics. Obse...
متن کاملGeneralised Bent Criteria for Boolean Functions (I)
Generalisations of the bent property of a boolean function are presented, by proposing spectral analysis with respect to a well-chosen set of local unitary transforms. Quadratic boolean functions are related to simple graphs and it is shown that the orbit generated by successive Local Complementations on a graph can be found within the transform spectra under investigation. The flat spectra of ...
متن کاملGeneralized Ritt type and generalized Ritt weak type connected growth properties of entire functions represented by vector valued Dirichlet series
In this paper, we introduce the idea of generalized Ritt type and generalised Ritt weak type of entire functions represented by a vector valued Dirichlet series. Hence, we study some growth properties of two entire functions represented by a vector valued Dirichlet series on the basis of generalized Ritt type and generalised Ritt weak type.
متن کاملA new class of semi-bent quadratic Boolean functions
In this paper, we present a new class of semi-bent quadratic Boolean functions of the form f(x) = ∑⌊m−1 2 ⌋ i=1 Tr n 1 (cix 1+4i) (ci ∈ F4,n = 2m). We first characterize the semi-bentness of these quadratic Boolean functions. There exists semi-bent functions only when m is odd. For the case: m = p, where p is an odd prime with some conditions, we enumerate the semi-bent functions. Further, we g...
متن کاملPersistency for higher-order pseudo-boolean maximization
A pseudo-Boolean function is a function from a 0/1-vector to the reals. Minimizing pseudo-Boolean functions is a very general problem with many applications. In image analysis, the problem arises in segmentation or as a subroutine in task like stero estimation and image denoising. Recent years have seen an increased interest in higher-degree problems, as opposed to quadratic pseudo-Boolean func...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Des. Codes Cryptography
دوره 66 شماره
صفحات -
تاریخ انتشار 2013